Pseudorandom Number Generation With Self-Programmable Cellular Automata
نویسندگان
چکیده
منابع مشابه
Layered Cellular Automata for Pseudorandom Number Generation
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set { | 1, 2, , 2 1} f n A f = − ... formed by the transformation matrix A of a maximum length Cellular Automata ...
متن کاملConfigurable Cellular Automata for Pseudorandom Number Generation
This paper proposes a generalized structure of cellular automata (CA) – the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell ...
متن کاملA Family of Controllable Cellular Automata for Pseudorandom Number Generation
In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs. The ENT and DIEHARD test suites are used to evaluate the randomness of these CCA PRNGs. The results show that their randomness is better than that of conventional CA and PCA PRNGs ...
متن کاملPseudorandom number generation based on controllable cellular automata
A novel Cellular Automata (CA) Controllable CA (CCA) is proposed in this paper. Further, CCA are applied in Pseudorandom Number Generation. Randomness test results on CCA Pseudorandom Number Generators (PRNGs) show that they are better than 1-d CA PRNGs and can be comparable to 2-d ones. But they do not lose the structure simplicity of 1-d CA. Further, we develop several different types of CC...
متن کاملNovel Pseudorandom Number Generator Scheme Employing 3-Dimensional Cellular Automata
This research proposes a novel three dimensional cellular automata (3-D CA) scheme for pseudo random number generation which is highly secure than the two dimensional cellular automata (2-D CA). It removes security and boundary problems with the 2-D CA. The use of 1-D CA was very common in late 80s which was then improved with 2-D CA. Research literature shows that 2-D CA is suffering from secu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2004
ISSN: 0278-0070
DOI: 10.1109/tcad.2004.829808